Connectedness criteria for graphs by means of omega invariant
نویسندگان
چکیده
منابع مشابه
On Connectedness of Graphs
A graph structure is deened on the Weyl groups. We show that these graphs are connected for Weyl groups of type An for n 4. 1. Introduction. We have deened a graph structure on Weyl groups through the root system associated with them. The planarity and the other properties of such graphs has been studied elsewhere (1] and 2]). The motivation for these graphs come from the method employed in pro...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Connectedness of Certain Random Graphs
L. Dubins conjectured in 1984 that the graph on vertices {1 , 2 , 3 , . . . } where an edge isdrawn between vertices i and j with probability p i j = λ/max (i , j) independently for each pair iand j is a.s. connected for λ = 1. S. Kalikow and B. Weiss proved that the graph is a.s.connected for any λ > 1. We prove Dubin’s conjecture and show that the graph is a.s. connectedfo...
متن کاملCONNECTEDNESS OF GRAPHS GENERATED BY A RANDOM d-PROCESS
Suppose that a graph process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always at most d . In a previous article, the authors showed that as n → ∞, with probability tending to 1, the result of this process is a d-regular graph. This graph is shown to be connected with probability asymptotic to 1. 2000 Mathemat...
متن کاملOPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM
This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2020
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil2002647s